Lower Bounds for Polynomials Using Geometric Programming
نویسندگان
چکیده
We make use of a result of Hurwitz and Reznick [8] [19], and a consequence of this result due to Fidalgo and Kovacec [5], to determine a new sufficient condition for a polynomial f ∈ R[X1, . . . , Xn] of even degree to be a sum of squares. This result generalizes a result of Lasserre in [10] and a result of Fidalgo and Kovacec in [5], and it also generalizes the improvements of these results given in [6]. We apply this result to obtain a new lower bound fgp for f , and we explain how fgp can be computed using geometric programming. The lower bound fgp is generally not as good as the lower bound fsos introduced by Lasserre [11] and Parrilo and Sturmfels [15], which is computed using semidefinite programming, but a run time comparison shows that, in practice, the computation of fgp is much faster. The computation is simplest when the highest degree term of f has the form ∑n i=1 aiX 2d i , ai > 0, i = 1, . . . , n. The lower bounds for f established in [6] are obtained by evaluating the objective function of the geometric program at the appropriate feasible points.
منابع مشابه
Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares representation. These criteria rely on the coefficients and the support of a polynomial and generalize all previous ones by Lasserre, Ghasemi, Marshall, Fidalgo and Ko...
متن کاملUniversal upper and lower bounds on energy of spherical designs
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds are optimal for absolutely monotone potentials in the sense that for the linear programming technique they cannot be improved by using polynomials of the sa...
متن کاملGeometric lower bounds for generalized ranks
We revisit a geometric lower bound for Waring rank of polynomials (symmetric rank of symmetric tensors) of [LT10] and generalize it to a lower bound for rank with respect to arbitrary varieties, improving the bound given by the “non-Abelian” catalecticants recently introduced by Landsberg and Ottaviani. This is applied to give lower bounds for ranks of multihomogeneous polynomials (partially sy...
متن کاملLower bounds on the global minimum of a polynomial
We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound fgp,M for a multivariate polynomial f(x) ∈ R[x] of degree ≤ 2d in n variables x = (x1, . . . , xn) on the closed ball {x ∈ Rn : ∑ x2d i ≤ M}, computable by geometric programming, for any real M . We compare this bound with the (global) lower bound fgp obtained by Ghasemi and Marshall, ...
متن کاملSome remarks on the arithmetic-geometric index
Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 22 شماره
صفحات -
تاریخ انتشار 2012